Heuristics for two-machine flowshop scheduling with setup times and an availability constraint
نویسندگان
چکیده
منابع مشابه
Heuristics for two-machine flowshop scheduling with setup times and an availability constraint
This paper studies the two-machine flowshop scheduling problem with anticipatory setup times and an availability constraint imposed on only one of the machines where interrupted jobs can resume their operations. We present two heuristics and show that their worst-case error bounds are no larger than 2/3.
متن کاملAn approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint
This paper studies the two-machine permutation flowshop scheduling problem with anticipatory setup times and an availability constraint imposed only on the first machine. The objective is to minimize the makespan. Under the assumption that interrupted jobs can resume their operations, we present a polynomial-time approximation scheme (PTAS) for this problem.
متن کاملAn improved heuristic for two-machine flowshop scheduling with an availability constraint
In this paper we study the two-machine owshop scheduling problem with an availability constraint on the rst machine. We rst show that the worst-case error bound 2 of the heuristic provided by Lee [4] is tight. We then develop an improved heuristic with a worst-case error bound of 3 . c © 2000 Elsevier Science B.V. All rights reserved.
متن کاملBatch Scheduling on Two-Machine Flowshop with Machine-Dependent Setup Times
The recent survey paper “A Survey on Scheduling Problems with Setup Times and Costs” 1 , classifies batch scheduling problems into those with batching and nonbatching considerations, with sequence-independent and sequence-dependent setup times, and according to the machine environment and the objective function. The survey contains approximately 300 references, a clear indication of the importa...
متن کاملStudy of Scheduling Problems with Machine Availability Constraint
In real world scheduling applications, machines might not be available during certain time periods due to deterministic or stochastic causes. In this article, the machine scheduling with availability constraints for both deterministic and stochastic cases with different environments, constraints and performance measures will be discussed. The existing body of research work in the literature wil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2007
ISSN: 0305-0548
DOI: 10.1016/j.cor.2005.05.003